Another Characterization of Straight Line Triangle Representations
نویسندگان
چکیده
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face are triangles. Such a drawing can be viewed as a tessellation of a triangle with triangles where the input graph is the skeletal structure. A characterization based on flat angle assignments, i.e., selections of angles of the graph that are of size π in the representation, has been presented in earlier work. The drawback of this characterization of SLTRs is that we have no efficient algorithm for testing whether a given graph admits a flat angle assignment that fulfills the conditions. In this paper we present a new characterization based on Schnyder woods. For graphs with few Schnyder woods there exists a polynomial algorithm to check whether the conditions of this characterization are satisfied. However there are planar 3-connected graphs on n vertices, which have 3.209 Schnyder woods. Hence, it is still open to decide whether the recognition of graphs that admit a straight line triangle representation is polynomially tractable.
منابع مشابه
Straight Line Triangle Representations
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with the input graph as skeletal structure. In this paper we present a characterization of graphs that have an SLTR. The charcterization is based on flat angle as...
متن کاملStraight-Line Triangle Representations via Schnyder Labelings
A straight-line triangle representation (SLTR) of a planar graph is a straight-line drawing such that all the faces including the outer face are triangles. Such a drawing can be viewed as a tiling of a triangle with triangles where the input graph is the skeletal structure. A characterization based on flat angle assignments, i.e., selections of angles of the graph that are of size π in the repr...
متن کاملBook Iv of Euclid’s Elements and Ancient Greek Mosaics
I.4: “If two triangles have the two sides equal to two sides respectively, and have the angles contained by the equal straight lines equal, they will also have the base equal to the base, the triangle will be equal to the remaining angles respectively, namely those which the equal sides subtend.” I.9: “To bisect a given rectilinear angle.” I.10: “To bisect a given finite straight line.” I.11: “...
متن کاملOn Touching Triangle Graphs
In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. The class of graphs with touching triangle representations is not closed under minors, making characterization difficult. We do show that pairs of vert...
متن کاملGeneralizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a certain speci ed size. We propose vertex representations having a rectangular shape. Additionally, one may demand maintainance of the criterion of strong visibility, that is, any possible line segment connecting two ad...
متن کامل